An Efficient Globally Optimal Algorithm for Asymmetric Point Matching
نویسندگان
چکیده
منابع مشابه
An Efficient Adaptive Boundary Matching Algorithm for Video Error Concealment
Sending compressed video data in error-prone environments (like the Internet and wireless networks) might cause data degradation. Error concealment techniques try to conceal the received data in the decoder side. In this paper, an adaptive boundary matching algorithm is presented for recovering the damaged motion vectors (MVs). This algorithm uses an outer boundary matching or directional tempo...
متن کاملA practical, globally optimal algorithm for geometric matching under uncertainty
Geometric matching under uncertainty is a long-standing problem in computer vision. This paper presents a simple and efficient algorithm for finding globally optimal solutions to geometric matching problems under a wide variety of allowable transformations (translations, isometries, equiform transformations, others) and a wide variety of allowable feature types (point features, oriented point f...
متن کاملAn Efficient Approximation Algorithm for Point Pattern Matching Under Noise
Point pattern matching problems are of fundamental importance in various areas including computer vision and structural bioinformatics. In this paper, we study one of the more general problems, known as LCP (largest common point set problem): Let P and Q be two point sets in R, and let ǫ ≥ 0 be a tolerance parameter, the problem is to find a rigid motion μ that maximizes the cardinality of subs...
متن کاملAn optimal parallel matching algorithm for cographs
The class of cographs, or complement-reducible graphs, arises naturally in many different areas of applied mathematics and computer science. We show that the problem of finding a maximum matching in a cograph can be solved optimally in parallel by reducing it to parenthesis matching. With an $n$-vertex cograph $G$ represented by its parse tree as input, our algorithm finds a maximum matching in...
متن کاملEfficient Algorithms for Globally Optimal Trajectories
We present serial and parallel algorithms for solving a system of equations that arises from the discretization of the Hamilton-Jacobi equation associated to a trajectory optimization problem of the following type. A vehicle starts at a prespecified point zo and follows a unit speed trajectory ~ ( t ) inside a region in P. until an unspecified time T that the region is exited. A trajectory mini...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Pattern Analysis and Machine Intelligence
سال: 2017
ISSN: 0162-8828,2160-9292
DOI: 10.1109/tpami.2016.2603988